MAT 585: Max-Cut and Stochastic Block Model
نویسنده
چکیده
Today we discuss two NP-hard problems, Max-Cut and minimum bisection. As these problems are NP-hard, unless the widely believed P 6= NP conjecture is false, these problem cannot be solved in polynomial time for every instance. These leaves us with a couple of alternatives: either we look for algorithms that approximate the solution, or consider algorithms that work for “typical” instances, but not for all. We will study a particular algorithm of the first type for Max-Cut and an algorithm of the second type for minimum bisection.
منابع مشابه
MAT 585: Exact Recovery of the Semidefinite Relaxation for Stochastic Block Model
Today we consider a semidefinite programming relaxation algorithm for SBM and derive conditions for exact recovery. The main ingredient for the proof will be duality theory.
متن کامل18.S096: Community dection and the Stochastic Block Model
Community detection in a network is a central problem in data science. A few lectures ago we discussed clustering and gave a performance guarantee for spectral clustering (based on Cheeger’s Inequality) that was guaranteed to hold for any graph. While these guarantees are remarkable, they are worst-case guarantees and hence pessimistic in nature. In what follows we analyze the performance of a ...
متن کاملA VNS Metaheuristic with Stochastic Steps for Max 3-Cut and Max 3-Section
A heuristic algorithm based on VNS is proposed to solve the Max 3-cut and Max 3-section problems. By establishing a neighborhood structure of the Max 3-cut problem, we propose a local search algorithm and a variable neighborhood global search algorithm with two stochastic search steps to obtain the global solution. We give some numerical results and comparisons with the well-known 0.836-approxi...
متن کاملThe non-convex Burer-Monteiro approach works on smooth semidefinite programs
Semidefinite programs (SDP’s) can be solved in polynomial time by interior point methods, but scalability can be an issue. To address this shortcoming, over a decade ago, Burer and Monteiro proposed to solve SDP’s with few equality constraints via rank-restricted, non-convex surrogates. Remarkably, for some applications, local optimization methods seem to converge to global optima of these nonc...
متن کاملSolving Large MAX CUT Problems Using Cross Entropy & Parametric Minimum Cross Entropy
Two stochastic optimization methods: Cross Entropy (CE) and Parametric Minimum Cross Entropy (PME) were tested against Large Max-Cut problems. The problems were taken from the "The DIMACS Library of Mixed Semidefinite-Quadratic-Linear Programs" challenge web site. The two methods achieved close and even better results than the Best Known Solution. In addition to results presentation, several im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015